Connuence of Orthogonal Higher-order Rewrite Systems: Proof by Parallel Moves
نویسنده
چکیده
In this paper we propose higher-order rewrite systems without bound variables. In order to prove their connuence under the assumption of orthogonality, we study a simple proof method which employs a characterization of the diamond property of a parallel reduction. By an application of the proof method, we obtain a new connuence result for orthogonal higher-order conditional rewrite systems.
منابع مشابه
Combinatory Reduction Systems: Introduction and Survey
Combinatory Reduction Systems, or CRSs for short, were designed to combine the usual rst-order format of term rewriting with the presence of bound variables as in pure-calculus and various typed-calculi. Bound variables are also present in many other rewrite systems, such as systems with simpliication rules for proof normalization. The original idea of CRSs is due to Aczel, who introduced a res...
متن کاملDevelopment Closed Critical Pairs
The class of orthogonal rewriting systems (rewriting systems where rewrite steps cannot depend on one another) is the main class of not-necessarily-terminating rewriting systems for which connuence is known to hold. Huet and Toyama have shown that for left-linear rst-order term rewriting systems (TRSs) the orthogonality restriction can be relaxed somewhat by allowing critical pairs (arising fro...
متن کاملCon uence of Orthogonal Higher - Order TRSs : Proof by Parallel Moves ( DRAFT )
In this paper we introduce higher-order rewrite systems without bound variables. In order to prove their con uence under the assumption of orthogonality, we study a simple proof method based on parallel moves, which ensures the diamond property of a parallel reduction. 1 Higher-Order TRS without Bound Variables In this section we provide a simple extension of rst-order rewrite systems (cf. [DJ9...
متن کاملHigher-order Rewrite Systems and Their Connuence
We study Higher-Order Rewrite Systems (HRSs) which extend term rewriting to-terms. HRSs can describe computations over terms with bound variables. We show that rewriting with HRSs is closely related to undirected equational reasoning. We deene Pattern Rewrite Systems (PRSs) as a special case of HRSs and extend three connuence results from term rewriting to PRSs: the critical pair lemma by Knuth...
متن کاملHigher-Order Rewrite Systems and Their Confluence
We introduce Higher-Order Rewrite Systems (HRS) which extend term rewriting to-terms. HRS can describe computations on arbitrary terms with bound variables. We show that rewriting is closely related to undirected equational reasoning , and extend three connuence results from term rewriting to HRS: the critical pair lemma by Knuth and Bendix, connuence of rewriting modulo equations a la Huet, an...
متن کامل